Phase Retrieval via Matrix Completion
نویسندگان
چکیده
This paper develops a novel framework for phase retrieval, a problem which arises in X-ray crystallography, diffraction imaging, astronomical imaging and many other applications. Our approach, called PhaseLift, combines multiple structured illuminations together with ideas from convex programming to recover the phase from intensity measurements, typically from the modulus of the diffracted wave. We demonstrate empirically that any complex-valued object can be recovered from the knowledge of the magnitude of just a few diffracted patterns by solving a simple convex optimization problem inspired by the recent literature on matrix completion. More importantly, we also demonstrate that our noise-aware algorithms are stable in the sense that the reconstruction degrades gracefully as the signal-to-noise ratio decreases. Finally, we introduce some theory showing that one can design very simple structured illumination patterns such that three diffracted figures uniquely determine the phase of the object we wish to recover.
منابع مشابه
Implicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval, Matrix Completion and Blind Deconvolution
Recent years have seen a flurry of activities in designing provably efficient nonconvex procedures for solving statistical estimation problems. Due to the highly nonconvex nature of the empirical loss, stateof-the-art procedures often require proper regularization (e.g. trimming, regularized cost, projection) in order to guarantee fast convergence. For vanilla procedures such as gradient descen...
متن کاملCompressive Phase Retrieval via Lifting
Phase retrieval has been a longstanding problem in optics and x-ray crystallography since the 1970s [3, 2]. Early methods to recover the phase signal using Fourier transform mostly relied on additional information about the signal, such as band limitation, nonzero support, real-valuedness, and nonnegativity. Common drawbacks of these iterative methods are that they may not converge to the globa...
متن کاملPhase recovery, MaxCut and complex semidefinite programming
Phase retrieval seeks to recover a signal x ∈ C from the amplitude |Ax| of linear measurements Ax ∈ C. We cast the phase retrieval problem as a non-convex quadratic program over a complex phase vector and formulate a tractable relaxation (called PhaseCut) similar to the classical MaxCut semidefinite program. We solve this problem using a provably convergent block coordinate descent algorithm wh...
متن کاملAN INVESTIGATION ON REACTIVE SINTERING OF NANO-CRYSTALLINE TiO2 -Al POWDER PREPARED BY MECHANICAL ALLOYING
In this research an ultra-fine grained composite structure consisting of an intermetallic matrix together with dispersed nano-sized Al2O3 obtained via mechanical activation of TiO2 and Al in a high energy ball mill and sintering of consolidated samples. Phase composition and morphology of the milled and sintered samples were evaluated by XRD and SEM techniques Thermal behavior of the powder sa...
متن کاملA Non-convex One-Pass Framework for Generalized Factorization Machines and Rank-One Matrix Sensing
We develop an efficient alternating framework for learning a generalized version of Factorization Machine (gFM) on steaming data with provable guarantees. When the instances are sampled from d dimensional random Gaussian vectors and the target second order coefficient matrix in gFM is of rank k, our algorithm converges linearly, achieves O(ǫ) recovery error after retrieving O(kd log(1/ǫ)) train...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM Review
دوره 57 شماره
صفحات -
تاریخ انتشار 2013